The bondage number of a graphFINK, J. F; JACOBSON, M. S; KINCH, L. F et al.Discrete mathematics. 1990, Vol 86, Num 1-3, pp 47-57, issn 0012-365X, 11 p.Article

Patterns in treesDERSHOWITZ, N; ZAKS, S.Discrete applied mathematics. 1989, Vol 25, Num 3, pp 241-255, issn 0166-218X, 15 p.Article

Alternating automata with start formulasMOSTOWSKI, A. W.Information processing letters. 1990, Vol 35, Num 6, pp 287-290, issn 0020-0190, 4 p.Article

Embedding mesh of trees in the hypercubeEFE, K.Journal of parallel and distributed computing (Print). 1991, Vol 11, Num 3, pp 222-230, issn 0743-7315, 9 p.Article

Embedding shuffle networks in hypercubesRAVI VARADARAJAN.Journal of parallel and distributed computing (Print). 1991, Vol 11, Num 3, pp 252-256, issn 0743-7315, 5 p.Article

The cyclic wirelength of treesBEZRUKOV, S. L; SCHROEDER, U.-P.Discrete applied mathematics. 1998, Vol 87, Num 1-3, pp 275-277, issn 0166-218XArticle

Calculs distribués dans les arbres: application au test du mineur = Distributed calculus in trees: application to the test minorParies, Alain; Courcelle, B.1996, 101 p.Thesis

Automata on infinite trees with counting constraintsBEAUQUIER, D; NIWINSKI, D.Information and computation (Print). 1995, Vol 120, Num 1, pp 117-125, issn 0890-5401Article

Mean distance in a treeWINKLER, P.Discrete applied mathematics. 1990, Vol 27, Num 1-2, pp 179-185, issn 0166-218XConference Paper

Hypertrees and Bonferroni inequalitiesTOMESCU, I.Journal of combinatorial theory. Series B. 1986, Vol 41, Num 2, pp 209-217, issn 0095-8956Article

The minimum gap on diluted Cayley treesSTINCHCOMBE, R. B; DUXBURY, P. M; SHUKLA, P et al.Journal of physics. A, mathematical and general. 1986, Vol 19, Num 18, pp 3903-3916, issn 0305-4470Article

Order distance associated with a hierarchyGUENOCHE, A.Journal of classification. 1997, Vol 14, Num 1, pp 101-115, issn 0176-4268Article

A randomized NC algorithm for the maximal tree cover problemZHI-ZHONG CHEN.Information processing letters. 1991, Vol 40, Num 5, pp 241-246, issn 0020-0190Article

Resilience of partial k-tree networks with edge and node failuresMATA-MONTERO, E.Networks (New York, NY). 1991, Vol 21, Num 3, pp 321-344, issn 0028-3045Article

A proof of Serre's theoremBIGGS, N. L.Discrete mathematics. 1989, Vol 78, Num 1-2, pp 55-57, issn 0012-365X, 3 p.Article

On a conjecture of Graham and Lovász about distance matricesCOLLINS, K. L.Discrete applied mathematics. 1989, Vol 25, Num 1-2, pp 27-35, issn 0166-218X, 9 p.Article

Modeling B-tree insertion activityDRISCOLL, J. R; SHEAU-DONGLANG; FRANKLIN, L. A et al.Information processing letters. 1987, Vol 26, Num 1, pp 5-18, issn 0020-0190Article

Ordered trees and non-crossing partitionsDERSHOWITZ, N; ZAKS, S.Discrete mathematics. 1986, Vol 62, Num 2, pp 215-218, issn 0012-365XArticle

Finding a weight-constrained maximum-density subtree in a treeHSIEH, Sun-Yuan; CHOU, Ting-Yu.Lecture notes in computer science. 2005, pp 944-953, issn 0302-9743, isbn 3-540-30935-7, 1Vol, 10 p.Conference Paper

Sur des équations diophantiennes généralisant celle de Markoff = On diophantine equations generalizing those of Markoff's theoryPERRINE, S.Annales de la faculté des sciences de Toulouse. 1997, Vol 6, Num 1, pp 127-141, issn 0240-2963Article

Sur les polynômes de Catalan simples et doubles = About simple and double Catalan polynomialsKREWERAS, G.European journal of combinatorics. 1991, Vol 12, Num 5, pp 389-396, issn 0195-6698Article

The average height of the d-th highest leaf of a planted plane treePRODINGER, H.Networks (New York, NY). 1986, Vol 16, Num 1, pp 67-75, issn 0028-3045Article

Cluster expansion for abstract polymer models. New bounds from an old approachFERNANDEZ, Roberto; PROCACCI, Aldo.Communications in mathematical physics. 2007, Vol 274, Num 1, pp 123-140, issn 0010-3616, 18 p.Article

Some remarks on distributed depth-first searchTSIN, Y. H.Information processing letters. 2002, Vol 82, Num 4, pp 173-178, issn 0020-0190Article

On consistency and width notions for constraint programs with algebraic constraintsMEER, Klaus.Lecture notes in computer science. 2002, pp 88-102, issn 0302-9743, isbn 3-540-44233-2, 15 p.Conference Paper